An Upper Bound in Goldbach's Problem
نویسندگان
چکیده
It is clear that the number of distinct representations of a number n as the sum of two primes is at most the number of primes in the interval [n/2, n-2]. We show that 210 is the largest value of n for which this upper bound is attained.
منابع مشابه
Extending Two-Dimensional Bin Packing Problem: Consideration of Priority for Items
In this paper a two-dimensional non-oriented guillotine bin packing problem is studied when items have different priorities. Our objective is to maximize the total profit which is total revenues minus costs of used bins and wasted area. A genetic algorithm is developed to solve this problem where a new coding scheme is introduced. To evaluate the performance of the proposed GA, first an upper b...
متن کاملAn Upper Bound on the First Zagreb Index in Trees
In this paper we give sharp upper bounds on the Zagreb indices and characterize all trees achieving equality in these bounds. Also, we give lower bound on first Zagreb coindex of trees.
متن کاملSeparable programming problems with the max-product fuzzy relation equation constraints
In this paper, the separable programming problem subject to Fuzzy Relation Equation (FRE) constraints is studied. It is decomposed to two subproblems with decreasing and increasing objective functions with the same constraints. They are solved by the maximum solution and one of minimal solutions of its feasible domain, respectively. Their combination produces the original optimal solution. The ...
متن کاملWeapon scheduling in naval combat systems for maximization of defense capabilities
Air defense is a crucial area for all naval combat systems. In this study, we consider a warship equipped with an air-defense weapon that targets incoming threats using surface-to-air missiles. We define the weapon scheduling problem as the optimal scheduling of a set of surface-to-air missiles of a warship to a set of attacking air threats. The optimal scheduling of the weapon results in an in...
متن کاملSolving the competitive facility location problem considering the reactions of competitor with a hybrid algorithm including Tabu Search and exact method
In this paper, a leader–follower competitive facility location problem considering the reactions of the competitors is studied. A model for locating new facilities and determining levels of quality for the facilities of the leader firm is proposed. Moreover, changes in the location and quality of existing facilities in a competitive market where a competitor offers the same goods or services ar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010